Approximate Zero-one Laws and Sharpness of the Percolation Transition in a Class of Models including Two-dimensional Ising Percolation
نویسنده
چکیده
One of the most well-known classical results for site percolation on the square lattice is the equation pc + p ∗ c = 1. In words, this equation means that for all values 6= pc of the parameter p, the following holds: either a.s. there is an infinite open cluster or a.s. there is an infinite closed “star” cluster. This result is closely related to the percolation transition being sharp: below pc, the size of the open cluster of a given vertex is not only (a.s.) finite, but has a distribution with an exponential tail. The analog of this result has been proven by Higuchi in 1993 for two-dimensional Ising percolation (at fixed inverse temperature β < βc) with external field h, the parameter of the model. Using sharp-threshold results (approximate zero-one laws) and a modification of an RSW-like result by Bollobás and Riordan, we show that these results hold for a large class of percolation models where the vertex values can be “nicely” represented (in a sense which will be defined precisely) by i.i.d. random variables. We point out that the ordinary percolation model obviously belongs to this class and we also show that the Ising model mentioned above belongs to it.
منابع مشابه
Approximate Zero-one Laws and Sharpness of the Percolation Transition in a Class of Models including Two-dimensional Ising
One of the most well-known classical results for site percolation on the square lattice is the equation pc +p∗ c = 1. In words, this equation means that for all values = pc of the parameter p, the following holds: either a.s. there is an infinite open cluster or a.s. there is an infinite closed “star” cluster. This result is closely related to the percolation transition being sharp: below pc, t...
متن کاملApproximate zero-one laws and sharpness of the percolation transition in a class of models including 2D Ising percolation
One of the most well-known classical results for site percolation on the square lattice is the equation pc + p ∗ c = 1. In words, this equation means that for all values 6= pc of the parameter p the following holds: Either a.s. there is an infinite open cluster or a.s. there is an infinite closed ‘star’ cluster. This result is closely related to the percolation transition being sharp: Below pc ...
متن کامل1 3 A ug 2 00 3 The Percolation Transition in the Zero - Temperature Domany Model
We analyze a deterministic cellular automaton σ· = (σn : n ≥ 0) corresponding to the zero-temperature case of Domany’s stochastic Ising ferromagnet on the hexagonal lattice H. The state space SH = {−1,+1} H consists of assignments of −1 or +1 to each site of H and the initial state σ0 = {σ0 x}x∈H is chosen randomly with P (σ0 x = +1) = p ∈ [0, 1]. The sites of H are partitioned in two sets A an...
متن کاملSharpness of the percolation transition in the two-dimensional contact process
For ordinary (independent) percolation on a large class of lattices it is well-known that below the critical percolation parameter pc, the cluster size distribution has exponential decay, and that power-law behaviour of this distribution can only occur at pc. This behaviour is often called ‘sharpness of the percolation transition’. For theoretical reasons as well as motivated by applied researc...
متن کاملInvasion Percolation in Presence of Gravity
Simultaneous capillary dominated displacement of the wetting and non-wetting phases are processes of interest in many disciplines including modeling of the penetration of polluting liquids in hydrology or the secondary migration in petroleum reservoir engineering. Percolation models and in particular invasion percolation is well suited to characterize the slow immiscible displaceme...
متن کامل